Fairness of seat allocation methods in proportional representation
نویسندگان
چکیده
منابع مشابه
Seat biases of apportionment methods for proportional representation
In proportional representation systems, an important issue is whether a given apportionment method favors larger parties at the expense of smaller parties. For an arbitrary number of parties, ordered from largest to smallest by their vote counts, we calculate (apparently for the first time) the expected differences between the seat allocation and the ideal share of seats, separately for each pa...
متن کاملSeat Biases in Proportional Representation Systems with Thresholds
In proportional representation systems, apportionment methods are used to convert the number of votes of a party into the number of seats allocated to this party. An interesting characteristic of any such method are the seat biases, that is, the expected differences between the actual seat allocation and the ideal share of seats, separately for each party, when parties are ordered from largest ...
متن کاملResource Allocation in Downlink MIMO-OFDMA with Proportional Fairness
A new scheme for MIMO-OFDMA (Multiple Input Multiple Output Orthogonal Frequency Division Multiple Access) downlink resource allocation is presented in this paper. It has an objective of maximizing the total system capacity while having constraints on the total available power and proportional fairness. Dominant eigenchannels obtained from MIMO state matrix are used to formulate this scheme wit...
متن کاملAdaptive Resource Allocation in Multiuser OFDM Systems with Proportional Fairness
Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless LAN systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-tonoise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the ...
متن کاملProportional Representation as Resource Allocation: Approximability Results
We model Monroe’s and Chamberlin and Courant’s multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (these variants correspond to optimizing total voter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORiON
سال: 2005
ISSN: 2224-0004
DOI: 10.5784/21-2-22